New Scheduling Algorithm for Providing Proportional Jitter in Differentiated Service Network

There exist a Model of Proportional Jitter Differentiated Service and Proportional Delay Differentiated Serivce, which provides proportional jitter or proportional delay between different classes. This first approach is very appropriated for high-speed networks because it does not require the implementation of the proportional jitter scheduling algorithms at all the routers in the network but only at the boundary, and hence extremely reduces the complexity. In this paper, we argue that the Proportionial Jitter Differentiated model has some advantages compared to the Proportional Delay Differentiated model. In addition, a new proportional jitter scheduling algorithm, called Proportional Average Jitter (PAJ), is created and its quality, in terms of longterms and short-term jitter within only one hop, is also analyzed. Furthermore, the performance of Proportional Jitter Differentiated model using PAJ as scheduling algorithm is compared to this model but using Relative Jitter Packet Scheduling, and to Proportional Delay Differentiated model using Waiting Time Priority, is compared, too.